Static correction of Maude programs with assertions
نویسندگان
چکیده
منابع مشابه
Deciding Assertions in Programs with References
Modular analysis of procedures using summaries is a key technique to improve scalability of software model checking. Existing software model checkers do not fully exploit procedural structure for modular analysis. In the SLAM project, modular analysis using procedure summaries is done on a Boolean Program model, which contains only boolean types. We extend Boolean Programs to include reference ...
متن کاملA Dynamic Logic for Unstructured Programs with Embedded Assertions
We present a program logic for an intermediate verification programming language and provide formal definitions of its syntax and semantics. The language is unstructured, indeterministic, and has embedded assertions. A set of sound rewrite rules which allow symbolic execution of programs is given. We prove the soundness of three inference rules using invariants which can be used to deal with lo...
متن کاملExecuting Assertions via Synthesized Logic Programs
Programming with assertions constitutes an effective tool to detect and correct programming errors. The ability of executing formal specifications is essential in order to test automatically an implementation against its assertions. However, formal assertions may describe recursive models which are difficult to identify so current assertion checkers limit, in a considerable way, the expressivit...
متن کاملTemporal assertions for sequential and concurrent programs
In this thesis, we present an extension to the well-known concept of assertions: temporal assertions allow the specification and validation of modal safety properties of an application at runtime. We see this as a necessary step in enforcing the growing number of implicit requirements of software specifications, which are often only informally defined in the documentation of application program...
متن کاملLearning Assertions to Verify Linked-List Programs
C programs that manipulate list-based dynamic data structures remain a challenging target for static verification. In this paper we employ the dynamic analysis of dsOli to locate and identify data structure operations in a program, and then use this information to automatically annotate that program with assertions in separation logic. These annotations comprise candidate pre/post-conditions an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2019
ISSN: 0164-1212
DOI: 10.1016/j.jss.2019.03.061